Algebraic solution of optimal scheduling problems subject to due dates for start time of project jobs
نویسندگان
چکیده
A direct solution is proposed for problems of drawing up the optimal schedule jobs in a project based on using models and methods tropical optimization. The development an plan are reduced to optimization, which consist minimizing objective function under given strict constraints start finish time jobs. As optimality criteria maximum deviation from due dates taken, needs be minimized. Strict form precedence relations bounds times Such tasks arise if it necessary one reason or another (for example, technological limitations safety requirements) at specified time. In article functions first described terms ordinary mathematics then considered sheduling set. Elements discussed presentation form. Then formulated idempotent problem Solution presented explicit analytical form, well suited both formal analysis numerical computations. An explanatory example provided end article.
منابع مشابه
The preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
متن کاملSpeed Scaling for Scheduling Problems with Immediate Start of Jobs
We study a scheduling model with speed scaling for machines and the immediate start requirement for jobs. Speed scaling improves the system performance, but incurs the energy cost. The immediate start condition implies that each job should be started exactly at its release time. We consider two cost functions, one that represents the quality of service and the other that corresponds to the cost...
متن کاملAdjustments of Release and Due Dates for Cumulative Scheduling Problems
This paper presents a set of satisfiability tests and time-bound adjustments that can be applied to cumulative scheduling problems. We introduce the Cumulative Scheduling Problem (CuSP), an extension of the m-machine problem in which activities, having both release and due dates, can require more than one unit of the resource. Given a CuSP instance, we present two necessary conditions for the e...
متن کاملthe preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: an integer programming approach
extensive research has been devoted to resource constrained project scheduling problem. however, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. in this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
متن کاملthe preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: an integer programming approach
extensive research has been devoted to resource constrained project scheduling problem. however, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. in this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ??????? ?????-?????????????? ????????????
سال: 2022
ISSN: ['1811-9905', '2542-2251']
DOI: https://doi.org/10.21638/spbu01.2022.403